Deterministic and stochastic methods for computing volumetric moduli of convex cones
نویسندگان
چکیده
منابع مشابه
Invariance of Closed Convex Cones for Stochastic Partial Differential Equations
The goal of this paper is to clarify when a closed convex cone is invariant for a stochastic partial differential equation (SPDE) driven by a Wiener process and a Poisson random measure, and to provide conditions on the parameters of the SPDE, which are necessary and sufficient.
متن کاملBornological Completion of Locally Convex Cones
In this paper, firstly, we obtain some new results about bornological convergence in locally convex cones (which was studied in [1]) and then we introduce the concept of bornological completion for locally convex cones. Also, we prove that the completion of a bornological locally convex cone is bornological. We illustrate the main result by an example.
متن کاملEgoroff Theorem for Operator-Valued Measures in Locally Convex Cones
In this paper, we define the almost uniform convergence and the almost everywhere convergence for cone-valued functions with respect to an operator valued measure. We prove the Egoroff theorem for Pvalued functions and operator valued measure θ : R → L(P, Q), where R is a σ-ring of subsets of X≠ ∅, (P, V) is a quasi-full locally convex cone and (Q, W) is a locally ...
متن کاملVolumetric Center Method for Stochastic Convex Programs using Sampling
We develop an algorithm for solving the stochastic convex program SCP by combining Vaidya s volumetric center interior point method VCM for solv ing non smooth convex programming problems with the Monte Carlo sampling technique to compute a subgradient A near central cut variant of VCM is developed and for this method an approach to perform bulk cut translation and adding multiple cuts is given...
متن کاملHybrid Deterministic-Stochastic Methods for Data Fitting
Many structured data-fitting applications require the solution of an optimization problem involving a sum over a potentially large number of measurements. Incremental gradient algorithms offer inexpensive iterations by sampling a subset of the terms in the sum; these methods can make great progress initially, but often slow as they approach a solution. In contrast, full-gradient methods achieve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational & Applied Mathematics
سال: 2010
ISSN: 1807-0302
DOI: 10.1590/s1807-03022010000200007